Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
121	The Phase Transition in Exact Cover Vamsi Kalapala∗ and Cristopher Moore∗,† {vamsi,moore}@cs.unm.edu, ∗ Department of Computer Science, University of New Mexico Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-10-23 11:39:06 Automated theorem proving NP-complete problems Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Resolution Unit propagation Constraint satisfaction Theoretical computer science Mathematics Applied mathematics
122	Abstract Model Counting: a novel approach for Quantification of Information Leaks Quoc-Sang Phan Pasquale Malacaria Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Electronic design automation Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Quicken Interchange Format Java Pathfinder Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
123	Artificial Intelligence–150 Local search characteristics of incomplete SAT procedures ✩ Dale Schuurmans ∗ , Finnegan Southey Department of Computer Science, University of Waterloo, Waterloo, ON N2L Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2005-06-24 17:14:13 Applied mathematics Mathematics Boolean satisfiability problem Local search Constraint satisfaction WalkSAT Theoretical computer science Constraint programming Logic in computer science
124	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
125	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
126	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
127	From Sampling to Model Counting Add to Reading List Source URL: www.ijcai.org Language: English - Date: 2009-01-13 06:27:57 Data analysis Variance Sampling Random variable Variable Statistical hypothesis testing Interpretation Random walk Boolean satisfiability problem Statistics Mathematics Probability theory
128	Approximate Counting by Sampling the Backtrack-free Search Space Vibhav Gogate and Rina Dechter Donald Bren School of Information and Computer Science, University of California, Irvine, CA 92697, {vgogate,dechter}@ics.uc Add to Reading List Source URL: sami.ics.uci.edu Language: English - Date: 2007-08-17 19:31:44 Computing Partial differential equations Importance sampling Variance reduction Lookup table Monte Carlo integration Boolean satisfiability problem Monte Carlo methods Theoretical computer science Mathematics
129	Saturn: A SAT-based Tool for Bug Detection? Yichen Xie and Alex Aiken Computer Science Department Stanford University {yxie,aiken}cs.stanford.edu Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-05-20 18:05:46 Formal methods Electronic design automation Logic in computer science NP-complete problems Model checking Data types Boolean satisfiability problem Ada Pointer Computing Software engineering Theoretical computer science
130	Symbolic Execution as DPLL Modulo Theories Quoc-Sang Phan Queen Mary University of London Abstract Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Constraint programming Automated theorem proving Logic in computer science Electronic design automation Formal methods Satisfiability Modulo Theories DPLL algorithm Boolean satisfiability problem Solver Theoretical computer science Applied mathematics Mathematics

UPDATE